Fast Routing Table Lookup Using CAMs
نویسندگان
چکیده
This paper investigates fast routing table lookup techniques, where the table is composed of hierarchical addresses such as those found in a national telephone network. The hierachical addresses provide important benefits in large networks; but existing fast routing table lookup technique, based on hardware such as Content Addressable Memory (CAM), work only with flat addresses. We present several fast routing table lookup solutions for hierarchical address based on binaryand ternary-CAMs and analyze the pros and cons of each.
منابع مشابه
Fast Update of Forwarding Tables in Internet Router Using AS Numbers
The updates of router forwarding tables can be made faster using the Autonomous System number corresponding to a prefix as an intermediate number between the prefix and the next-hop address. At the cost of fast update, one table lookup introduces small additional delay, which can be eliminated by pipelining. This scheme is applicable to several routing table lookup algorithms for fast update.
متن کاملFast IP routing lookup with configurable processor and compressed routing table
-In this paper we examine a primitive data structure for routing lookup called 24/8 which requires about 32 MB memory to store the routing table information. A novel compression algorithm is used to reduce the memory requirement to about 3 MB. The data structure is common for both route lookup and update. We present a fast route lookup algorithm and an efficient update algorithm that supports i...
متن کاملProject of IPv6 Router with FPGA Hardware Accelerator
Packet processing is pipelined. A packet flows through the FPGA and memories. An incoming packet is received by the Input Packet Buffer and passed to the Header Field Extractor. The HFE pushes the body of the packet into the dynamic memory. Meanwhile, it parses its headers and creates a Unified-header and a structure reflecting actual arrangement of the headers. The Unified-header is a fixed st...
متن کاملDesign of fast lookup Content Addressable Memory (CAM) of a Next Generation IPv6 Network Processor
Ideally, the major problem of header lookup in a Next Generation IPv6 Network Processor could be solved by using an appropriately large Content Addressable Memory (CAM) structure containing preprocessed routing and firewall rules. Currently, there are no sufficiently wide CAMs available in the market. As only around 272 bits out of 596 needed can be matched in CAM for IPv6 packet processing, se...
متن کاملA High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کامل